Replica Shuffled Belief Propagation Decoding of LDPC Codes

Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations show that the new decoders offer good performance versus complexity trade-offs. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c ©Mitsubishi Electric Research Laboratories, Inc., 2005 201 Broadway, Cambridge, Massachusetts 02139 Presented at the Conference on Information Sciences and Systems (CISS-2005) held at Johns Hopkins University in March, 2005. Replica Shuffled Belief Propagation Decoding of LDPC Codes Juntan Zhang, Yige Wang and Marc Fossorier Department of Electrical Engineering University of Hawaii at Manoa Honolulu, HI 96822 Jonathan S. Yedidia Mitsubishi Electric Research Laboratories 201 Broadway, Cambridge, MA 02139